Semantics and typing issues / Questions de sémantique et typage
ثبت نشده
چکیده
The standard printf function takes a format string fmt containing plain characters and conversion specifications, each of which causes conversion and printing of printf’s remaining arguments. For instance, in OCaml, one can write: La fonction standard printf prend une châıne de formatage fmt qui contient des caractères et des spécifications de conversion provoquant la conversion et l’affichage des arguments suivants de printf. Par exemple, en OCaml, on peut écrire :
منابع مشابه
Semantics and typing issues / Questions de sémantique et typage
The standard printf function takes a format string fmt containing plain characters and conversion specifications, each of which causes conversion and printing of printf’s remaining arguments. For instance, in OCaml, one can write: La fonction standard printf prend une châıne de formatage fmt qui contient des caractères et des spécifications de conversion provoquant la conversion et l’affichage ...
متن کاملDirectional Types for Logic Programs and the Annotation Method Directional Types for Logic Programs and the Annotation Method
A directional type for a Prolog program expresses certain properties of the operational semantics of the program. This paper shows that the annotation proof method, proposed by Deransart for proving declarative properties of logic programs, is also applicable for proving correctness of directional types. In particular, the suucient correctness criterion of well-typedness by Bronsard et al, turn...
متن کاملSubtyping Constraints in Quasi-lattices
In this report, we show the decidability and NP-completeness of the satisfiability problem for non-structural subtyping constraints in quasi-lattices. This problem, first introduced by Smolka in 1989, is important for the typing of logic and functional languages. The decidability result is obtained by generalizing Trifonov and Smith’s algorithm over lattices, to the case of quasi-lattices. Simi...
متن کاملAn Interpretation of Typed Objects into Typed pi-Calculus
An interpretation of Abadi and Cardelli's rst-order functional Object Calculus AC94b] into a typed-calculus is presented. The interpretation validates the subtyping relation and the typing judgements of the Object Calculus, and is computationally adequate. The type language for the-calculus is that in PS93] a development of Milner's sorting discipline Mil91] with I/O annotations to separate the...
متن کاملTypage des horloges périodiques en Lucy-n
Lucy-n est un langage permettant de programmer des réseaux de processus communiquant à travers des buffers de taille bornée. La taille des buffers et les rythmes d’exécution relatifs des processus sont calculés par une phase de typage appelée calcul d’horloge. Ce typage nécessite la résolution d’un ensemble de contraintes de sous-typage. L’an dernier, nous avons proposé un algorithme de résolut...
متن کامل